A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 17 July 2020Accepted: 07 June 2021Published online: 18 October 2021Keywordsplanar graphs, polynomial kernel, odd cycle transversal, vertex multiway cutAMS Subject Headings68Q25, 68W40, 68R10, 05C10, 05C85Publication DataISSN (print): 0895-4801ISSN (online): 1095-7146Publisher: Society for Industrial and Applied MathematicsCODEN: sjdmec
منابع مشابه
Odd Multiway Cut in Directed Acyclic Graphs
We investigate the odd multiway node (edge) cut problem where the input is a graph with a specified collection of terminal nodes and the goal is to find a smallest subset of non-terminal nodes (edges) to delete so that the terminal nodes do not have an odd length path between them. In an earlier work, Lokshtanov and Ramanujan showed that both odd multiway node cut and odd multiway edge cut are ...
متن کاملSubexponential Parameterized Odd Cycle Transversal on Planar Graphs
In the Odd Cycle Transversal (OCT) problem we are given a graph G on n vertices and an integer k, and the objective is to determine whether there exists a vertex set O in G of size at most k such that G \ O is bipartite. Reed, Smith, and Vetta [Oper. Res. Lett., 2004] gave an algorithm for OCT with running time 3knO(1). Assuming the exponential time hypothesis of Impagliazzo, Paturi and Zane, t...
متن کاملA polynomial-time approximation scheme for planar multiway cut
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), a multiway cut (also called a multi-terminal cut) problem asks for a subset of edges with minimum total length and whose removal disconnects each terminal from the others. It generalizes the min st-cut problem but is NP-hard for planar graphs and APX-hard for general graphs. We give a polynomial-time appro...
متن کاملOn Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal
TheOdd Cycle Transversal problem (oct) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of oct with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Od...
متن کاملTowards optimal kernel for connected vertex cover in planar graphs
We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP ⊆ coNP/poly), for planar graphs Guo and Niedermeier [ICALP’08] showed a kernel with at most 14k vertices, subsequently improved by Wang et al. [MFCS’11] to 4k....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2021
ISSN: ['1095-7146', '0895-4801']
DOI: https://doi.org/10.1137/20m1353782